A non-classical refinement of the interpolation property for classical propositional logic
نویسنده
چکیده
We refine the interpolation property of the {∧,∨,¬}-fragment of classical propositional logic, showing that if 2 ¬φ, 2 ψ and φ ψ then there is an interpolant χ, constructed using at most atomic formulas occurring in both φ and ψ and negation, conjunction and disjunction, such that (i) φ entails χ in Kleene’s strong three-valued logic and (ii) χ entails ψ in Priest’s Logic of Paradox.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملInterpolation in Equilibrium Logic and Answer Set Programming: the Propositional Case
Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the non-monotonic system of equilibrium logic, establishing weaker or stronger forms of interpolation depending on the precise interpretation of the inference r...
متن کاملStrong amalgamation, Beck-Chevalley for equivalence relations and interpolation in algebraic logic
We extend Makkai’s proof of strong amalgamation (push-outs of monos along arbitrary maps are monos) from the category of Heyting algebras to a class which includes the categories of symmetric bounded distributive lattices, symmetric Heyting algebras, Heyting modal S4-algebras, Heyting modal bi-S4-albegras, and Lukasiewicz n-valued algebras. We also extend and improve Pitt’s proof that strong am...
متن کاملA refinement of the Craig–Lyndon Interpolation Theorem for classical first-order logic with identity
We refine the interpolation property of classical first-order logic (without identity and without function symbols), showing that if Γ & , & ∆ and Γ $ ∆ then there is an interpolant χ, constructed using only non-logical vocabulary common to both members of Γ and members of ∆, such that (i) Γ entails χ in the first-order version of Kleene’s strong three-valued logic, and (ii) χ entails ∆ in the ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015